On the independent set problem in random graphs
نویسندگان
چکیده
منابع مشابه
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipped independently with a probability of ε > 0. Our algorithm runs in expected polynomial time and guarantees an approximation ratio of roughly O( √ nε), which beats the inapproximability bounds.
متن کاملOn the Dominating Set Problem in Random Graphs
In this paper, we study the Dominating Set problem in random graphs. In a random graph, each pair of vertices are joined by an edge with a probability of p, where p is a positive constant less than 1. We show that, given a random graph in n vertices, a minimum dominating set in the graph can be computed in expected 2 2 2 n) time. For the parameterized dominating set problem, we show that it can...
متن کاملThe maximum independent set problem on layered graphs
The independent set on a graph G = (V, E) is a subset of V such that no two vertices in the subset have an edge between them. The maximum independent set problem on G seeks to identify an independent set with maximum cardinality, i.e. maximum independent set or MIS. The maximum independent set problem on a general graph is known to be NP-complete. On certain classes of graphs MIS can be compute...
متن کاملAn Interior Point Approach to the Maximum Independent Set Problem in Dense Random Graphs∗
We present an interior point approach to the zero-one integer programming feasibility problem based on the minimization of an appropriate potential function. Given a polytope defined by a set of linear inequalities, this procedure generates a sequence of strict interior points of this polytope, such that each consecutive point reduces the value of the potential function. An integer solution (no...
متن کاملThe Maximum Independent Set Problem in Subclasses of Subcubic Graphs
The Maximum Independent Set problem is NP-hard and remains NP-hard for graphs with maximum degree three (also called subcubic graphs). In our talk we will study its complexity in hereditary subclasses of subcubic graphs. Let A r q be the graph consisting of an induced cycle C q and an induced path with r edges having an endvertex in common with the C q , where A 1 4 is known as the banner. Our ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2014
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160.2014.976210